Randomized priority algorithms
نویسندگان
چکیده
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effect of randomization in greedy-like algorithms. More specifically, we consider approximation ratios within the context of randomized priority algorithms. As case studies, we prove inapproximation results for two well-studied optimization problems, namely facility location and makespan scheduling.
منابع مشابه
Parallel Priority Queue and List Contraction: The BSP Approach
In this paper we present eecient and practical extensions of the randomized Parallel Priority Queue (PPQ) algorithms of Ranade et al., and eecient randomized and deterministic algorithms for the problem of list contraction on the Bulk-Synchronous Parallel (BSP) model. We also present an experimental study of their performance. We show that our algorithms are communication eecient and achieve sm...
متن کاملFast Priority Queues for Parallel Branch-and-Bound
Currently used parallel best rst branch-and-bound algorithms either suuer from contention at a centralized priority queue or can only approximate the best rst strategy. Bottleneck free algorithms for parallel priority queues are known but they cannot be implemented very eeciently on contemporary machines. We present quite simple randomized algorithms for parallel priority queues on distributed ...
متن کاملRandomized Priority Queues for Fast Parallel Access
We present simple randomized algorithms for parallel priority queues on distributed memory machines. Inserting O(n) elements or deleting the O(n) out of m smallest elements using n pocessors requires O (
متن کاملRealistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model
In this paper, we explore parallel implementations of the abstract data type priority queue. We use the BSP* model, an extension of Valiant's BSP model which rewards blockwise communication, i.e. sending a few large messages instead of many small ones. We present two randomized approaches for diierent relations between the size of the data structure and the number of parallel updates to be perf...
متن کاملFast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems
We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent priority queues are based on mutual exclusion. However, mutual exclusion causes blocking which has several drawbacks and degrades the overall perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 411 شماره
صفحات -
تاریخ انتشار 2010